Quasi-stability of a vector trajectorial problem with non-linear partial criteria
نویسندگان
چکیده
Multi-objective (vector) combinatorial problem of finding the Pareto set with four kinds of non-linear partial criteria is considered. Necessary and sufficient conditions of that kind of stability of the problem (quasi-stability) are obtained. The problem is a discrete analogue of the lower semicontinuity by Hausdorff of the optimal mapping. Mathematics Subject Classification 2000: 90C10, 90C05, 90C29, 90C31.
منابع مشابه
On quasistability of a vector combinatorial problem with Σ-MINMAX and Σ-MINMIN partial criteria
We consider one type of stability (quasistability) of a vector combinatorial problem of finding the Pareto set. Under quasistability we understand a discrete analogue of lower semicontinuity by Hausdorff of the many-valued mapping, which defines the Pareto choice function. A vector problem on a system of subsets of a finite set (trajectorial problem) with non-linear partial criteria is in focus...
متن کاملNumerical measure of strong stability and strong quasistability in the vector problem of integer linear programming
In this paper we consider a vector integer programming problem with the linear partial criteria. Numerical evaluations of two types of stability of the Pareto set have been found. Usually the stability (quasistability) of a vector optimization problem (see [1-10]) is understood as the property of nonappearance of new optimal solutions (preservation of initial) under small perturbations of the p...
متن کاملStability of a majority efficient solution of a vector linear trajectorial problem
The multicriteria problem of majority choice on a system of subsets of a finite set with linear partial criteria (MINSUM) is considered. Sufficient and necessary conditions of preserving majority efficiency by an efficient trajectory under " small " perturbations of vector criterion coefficients have been found. Lower and upper attainable estimates of the stability radius of a majority efficien...
متن کاملStability, pseudostability and quasistability of vector trajectorial lexicographic optimization problem
Lower bounds of stability, pseudostability and quasistability radii of lexicographic set in vector combinatorial problem on systems of subsets of finite set with partial criteria of more general kinds have been found. Many specialists are engaged in study of stability of discrete optimization problems to perturbations of their parameters (see [1-3]). Need for investigation of stability of optim...
متن کاملOn quasistability radius of a vector trajectorial problem with a principle of optimality generalizing Pareto and lexicographic principles
A multicriterion linear combinatorial problem with a parametric principle of optimality is considered. This principle is defined by a partitioning of partial criteria onto Pareto preference relation groups within each group and the lexicographic preference relation between them. Quasistability of the problem is investigated. This type of stability is a discrete analog of Hausdorff lower semi-co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- The Computer Science Journal of Moldova
دوره 11 شماره
صفحات -
تاریخ انتشار 2003